Bipartite regular graphs with fixed diameter
نویسندگان
چکیده
منابع مشابه
Bipartite regular graphs with fixed diameter
For given nonnegative integers k and D , we consider the problem of determining n,(k, D ) , the smallest number n for which there exists a k-regular bipartite graph on n vertices with diameter D . We solve the problem for all pairs ( k , D ) with D + 2 (mod 4) and D + 3 (mod 4), for all pairs ( k , D ) with k even or k prime and D + 3 (mod 4), for all pairs with D I 9 or k I 4, and for a few ot...
متن کاملq - regular bipartite graphs
An explicit construction of a family of binary LDPC codes called LU(3, q), where q is a power of a prime, was recently given. A conjecture was made for the dimensions of these codes when q is odd. The conjecture is proved in this note. The proof involves the geometry of a 4-dimensional symplectic vector space and the action of the symplectic group and its subgroups.
متن کاملOn Bipartite Q-Polynomial Distance-Regular Graphs with Diameter 9, 10, or 11
Let Γ denote a bipartite distance-regular graph with diameter D. In [J. S. Caughman, Bipartite Q-polynomial distance-regular graphs, Graphs Combin. 20 (2004), 47–57], Caughman showed that if D > 12, then Γ is Q-polynomial if and only if one of the following (i)-(iv) holds: (i) Γ is the ordinary 2D-cycle, (ii) Γ is the Hamming cube H(D, 2), (iii) Γ is the antipodal quotient of the Hamming cube H...
متن کاملTight Distance-regular Graphs with Small Diameter
We prove the following bound for a k regular graph on n vertices with nontrivial eigenvalues from the interval r s n k rs k r k s Equality holds if and only if the graph is strongly regular with eigenvalues in fk s rg Nonbipartite distance regular graphs with diameter d and eigenvalues k d whose local graphs satisfy the above bound with equality for s b and r b d are called tight graphs and are...
متن کاملSuperconnectivity of regular graphs with small diameter
A graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vertices adjacent with one vertex. In this paper we prove for any r-regular graph of diameter D and odd girth g that if D ≤ g − 2, then the graph is super-κ when g ≥ 5 and a complete graph otherwise.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 1995
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.3230260303